Comparison of two approximations for the loss probability in finite-buffer queues
نویسندگان
چکیده
This note deals with two related approximations that were recently proposed for the loss probability in finite-buffer queues. The purpose of the paper is two-fold. First, to provide better insight and more theoretical support for both approximations. Second, to show by an experimental study how well both approximations perform. An interesting empirical finding is that in many cases of practical interest the two approximations provide upper and lower bounds on the exact value of the loss probability.
منابع مشابه
M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملAnalysis of High-order Approximations by Spectral Interpolation Applied to One- and Two-dimensional Finite Element Method
The implementation of high-order (spectral) approximations associated with FEM is an approach to overcome the difficulties encountered in the numerical analysis of complex problems. This paper proposes the use of the spectral finite element method, originally developed for computational fluid dynamics problems, to achieve improved solutions for these types of problems. Here, the interpolation n...
متن کاملPerformance Analysis of Cell and Packet Switch with Finite Input Queues and Ilpf Scheduling Algorithm
In this paper, packet loss probability performance in cell-based and packet-based switches with finite Input Queues (IQ) and iLPF scheduling algorithm are analysed. This algorithm has been proposed as a practical scheduling algorithm to achieve 100% throughput in cell-based switches. The scheduling algorithm is implemented in three cases: cellbased (CB-iLPF) switching, packet-based (PB-iLPF) sw...
متن کاملAnalysis of two production inventory systems with buffer, retrials and different production rates
This paper considers the comparison of two ðs; SÞ production inventory systems with retrials of unsatisfied customers. The time for producing and adding each item to the inventory is exponentially distributed with rate b. However, a production rate ab higher than b is used at the beginning of the production. The higher production rate will reduce customers’ loss when inventory level appro...
متن کاملOn Product Form Approximations for Communication Networks with Losses: Error Bounds
This paper studies communication networks with packet or message losses due to collisions, transmission errors and finite buffer constraints. A priori and easily computable error bounds are established for simple product form approximations. These approximations are based on ignoring and/or bounding loss probabilities. Two extreme situations are considered: (i) Networks with infinite capacities...
متن کامل